Emergence of Learning: An Approach to Coping with NP-Complete Problems in Learning

نویسندگان

  • Bao-Liang Lu
  • Michinori Ichikawa
چکیده

Various theoretical results show that learning in conventional feedforward neural networks such as multilayer perceptrons is NP-complete. In this paper we show that learning in min-max modular (M3) neural networks is tractable. The key to coping with NP-complete problems in M3 networks is to decompose a large-scale problem into a number of manageable, independent subproblems and to make the learning of a large-scale problem emerge from the learning of a number of related small subproblems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effect of coping with stress training on the social adjustment of students with learning disability

Learning disability includes wide range of educational problems which treating these problems need child's social, emotional and behavior treatment. As prevalence of learning disabilities among children and their difficulties, the purpose of this study was to investigate the effect of coping with stress training on social adjustment of students with learning disabilities. The statistical popula...

متن کامل

A Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem

Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the J...

متن کامل

An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method

In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...

متن کامل

Pronunciation Barriers and Computer Assisted Language Learning (CALL): Coping the Demands of 21st Century in Second Language Learning Classroom in Pakistan

Pronunciation of English language is a very important sub-skill of speaking module in second language learning process. However, it is ignored, neglected, and even never gotten least attention by the teachers, administrators, and stakeholders especially in Pakistan. Grammar, vocabulary, and the other linguistic skills such as reading and writing are emphasized whereas pronunciation has never be...

متن کامل

Two-stage fuzzy-stochastic programming for parallel machine scheduling problem with machine deterioration and operator learning effect

This paper deals with the determination of machine numbers and production schedules in manufacturing environments. In this line, a two-stage fuzzy stochastic programming model is discussed with fuzzy processing times where both deterioration and learning effects are evaluated simultaneously. The first stage focuses on the type and number of machines in order to minimize the total costs associat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000